Resolution of the uniform lower bound problem in constructive analysis
نویسنده
چکیده
In a previous paper we constructed a full and faithful functor M from the category of locally compact metric spaces to the category of formal topologies (representations of locales). Here we show that for a real-valued continuous function f , M ( f ) factors through the localic positive reals if, and only if, f has a uniform positive lower bound on each ball in the locally compact space. We work within the framework of Bishop constructive mathematics, where the latter notion is strictly stronger than point-wise positivity. MSC: 03F55, 03F60, 06D22
منابع مشابه
Bearing Capacity of Strip Footings near Slopes Using Lower Bound Limit Analysis
Stability of foundations near slopes is one of the important and complicated problems in geotechnical engineering, which has been investigated by various methods such as limit equilibrium, limit analysis, slip-line, finite element and discrete element. The complexity of this problem is resulted from the combination of two probable failures: foundation failure and overall slope failure. The curr...
متن کاملA Parameter Uniform Numerical Scheme for Singularly Perturbed Differential-difference Equations with Mixed Shifts
In this paper, we consider a second-order singularly perturbed differential-difference equations with mixed delay and advance parameters. At first, we approximate the model problem by an upwind finite difference scheme on a Shishkin mesh. We know that the upwind scheme is stable and its solution is oscillation free, but it gives lower order of accuracy. So, to increase the convergence, we propo...
متن کاملA Multi-Period 1-Center Location Problem in the Presence of a Probabilistic Line Barrier
This paper investigates a multi-period rectilinear distance 1-center location problem considering a line-shaped barrier, in which the starting point of the barrier follows the uniform distribution function. In addition, the existing points are sensitive to demands and locations. The purpose of the presented model is to minimize the maximum barrier distance from the new facility to the existing ...
متن کاملRESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose th...
متن کاملHeuristic approach to solve hybrid flow shop scheduling problem with unrelated parallel machines
In hybrid flow shop scheduling problem (HFS) with unrelated parallel machines, a set of n jobs are processed on k machines. A mixed integer linear programming (MILP) model for the HFS scheduling problems with unrelated parallel machines has been proposed to minimize the maximum completion time (makespan). Since the problem is shown to be NP-complete, it is necessary to use heuristic methods to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Math. Log. Q.
دوره 54 شماره
صفحات -
تاریخ انتشار 2008